Spherical Designs via Brouwer Fixed Point Theorem
نویسندگان
چکیده
For each N ≥ cdn 2d(d+1) d+2 we prove the existence of a spherical ndesign on Sd consisting of N points, where cd is a constant depending only on d.
منابع مشابه
Existence of Solutions to Systems of Underdetermined Equations and Spherical Designs
This paper is concerned with proving the existence of solutions to an underdetermined system of equations and with the application to existence of spherical t-designs with (t+ 1)2 points on the unit sphere S2 in R3. We show that the construction of spherical designs is equivalent to solution of underdetermined equations. A new verification method for underdetermined equations is derived using B...
متن کاملA Nontrivial Solution to a Stochastic Matrix Equation
If A is a nonsingular matrix such that its inverse is a stochastic matrix, the classic Brouwer fixed point theorem implies that the matrix equation AXA = XAX has a nontrivial solution. An explicit expression of this nontrivial solution is found via the mean ergodic theorem, and fixed point iteration is considered to find a nontrivial solution.
متن کاملThe Hex Game Theorem and the Arrow Impossibility Theorem: the Case of Weak Orders
The Arrow impossibility theorem when individual preferences are weak orders is equivalent to the HEX game theorem. Because Gale showed that the Brouwer fixed point theorem is equivalent to the HEX game theorem, this paper indirectly shows the equivalence of the Brouwer fixed point theorem and the Arrow impossibility theorem. Chichilnisky showed the equivalence of her impossibility theorem and t...
متن کاملA Proof of the Jordan Curve Theorem via the Brouwer Fixed Point Theorem
The aim of the paper is to report on MIZAR codification of the Jordan curve theorem, a theorem chosen as a challenge to be completely verified using formal methods at the time when they started being commonly used. Formalization was done based on proofs taken from the literature, where theorems mentioned in the title of the paper from ”Brouwer’s Fixed Point Theorem and the Jordan Curve Theorem”...
متن کاملSimplicity of Modules given by Oppositeness Relations in Spherical Buildings
Oppositeness graphs of a spherical building are generalizations of the classical Kneser graphs. Recently Brouwer [1] has shown that the square of each eigenvalue of the adjacency matrix of an oppositeness graph is a power of q, for buildings of finite groups of Lie type defined over Fq. Here we show that the incidence modules are simple. The essential part of the proof is a result of Carter and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 24 شماره
صفحات -
تاریخ انتشار 2010